Probabilistic Analysis of LLL Reduced Bases
نویسنده
چکیده
Lattice reduction algorithms behave much better in practice than their theoretical analysis predicts, with respect to both output quality and runtime. In this paper we present a probabilistic analysis that proves an average-case bound for the length of the first basis vector of an LLL reduced basis which reflects LLL experiments much better. Additionally, we use the same method to generate average-case values for BKZ reduced bases.
منابع مشابه
On the Structure of Reduced Kernel Lattice Bases
Lattice-based reformulation techniques have been used successfully both theoretically and computationally. One such reformulation is obtained from the lattice kerZ(A) = {x ∈ Z | Ax = 0}. Some of the hard instances in the literature that have been successfully tackled by lattice-based techniques, such as market split and certain classes of knapsack instances, have randomly generated input A. The...
متن کاملSegment LLL Reduction of Lattice Bases Using Modular Arithmetic
The algorithm of Lenstra, Lenstra, and Lovász (LLL) transforms a given integer lattice basis into a reduced basis. Storjohann improved the worst case complexity of LLL algorithms by a factor of O(n) using modular arithmetic. Koy and Schnorr developed a segment-LLL basis reduction algorithm that generates lattice basis satisfying a weaker condition than the LLL reduced basis with O(n) improvemen...
متن کاملLattice Reduction in Two Dimensions: Analyses under Realistic Probabilistic Models
The Gaussian algorithm for lattice reduction in dimension 2 is precisely analysed under a class of realistic probabilistic models, which are of interest when applying the Gauss algorithm “inside” the LLL algorithm. The proofs deal with the underlying dynamical systems and transfer operators. All the main parameters are studied: execution parameters which describe the behaviour of the algorithm ...
متن کاملA modified LLL algorithm for change of ordering of Grobner basis
In this paper, a modied version of LLL algorithm, which is a an algorithm with output-sensitivecomplexity, is presented to convert a given Grobner basis with respect to a specic order of a polynomialideal I in arbitrary dimensions to a Grobner basis of I with respect to another term order.Also a comparison with the FGLM conversion and Buchberger method is considered.
متن کاملSegment and Strong Segment LLL-Reduction of Lattice Bases
We present an efficient variant of LLL-reduction of lattice bases in the sense of Lenstra, Lenstra, Lovász [LLL82]. We organize LLL-reduction in segments of size k. Local LLL-reduction of segments is done using local coordinates of dimension 2k. Strong segment LLL-reduction yields bases of the same quality as LLL-reduction but the reduction is n-times faster for lattices of dimension n. We exte...
متن کامل